A ρ-calculus of explicit constraint application
نویسندگان
چکیده
منابع مشابه
A ρ-calculus of explicit constraint application
Theoretical presentations of the ρ-calculus often treat the matching constraint computations as an atomic operation although matching constraints are explicitly expressed. Actual implementations have to take a more realistic view: computations needed in order to find the solutions of a matching equation can have an important impact on the (efficiency of the) calculus for some matching theories ...
متن کاملDistributive ρ-calculus
The rewriting calculus has been introduced as a general formalism that uniformlyintegrates rewriting and λ-calculus. In this calculus all the basic ingredients ofrewriting such as rewrite rules, rule applications and results are rst-class objects.The rewriting calculus has been originally designed and used for expressing thesemantics of rule based as well as object oriented ...
متن کاملRepresenting Proof-Planning in the ρ-Calculus
Introduction. Proof planning is a theorem proving technique in which proofs are not conceived immediately by using the low-level calculus rules but at a higher level of abstraction that highlights the main ideas and the outline of a proof and de-emphasizes minor logical or mathematical manipulations on formulae. Hence, proof planning considerably differs from traditional proof search strategies...
متن کاملA Calculus of Constructions with Explicit Subtyping
The calculus of constructions can be extended with an infinite hierarchy of universes and cumulative subtyping. Subtyping is usually left implicit in the typing rules. We present an alternative version of the calculus of constructions where subtyping is explicit. We avoid problems related to coercions and dependent types by using the Tarski style of universes and by adding equations to reflect ...
متن کاملA Calculus of Explicit Substitutions Which Preserves Strong Normalisation , a Calculus of Explicit Substitutions Which Preserves Strong Normalisation
Explicit substitutions were proposed by Abadi, Cardelli, Curien, Hardin and LLvy to internalise substitutions into-calculus and to propose a mechanism for computing on substitutions. is another view of the same concept which aims to explain the process of substitution and to decompose it in small steps. is simple and preserves strong normalisation. Apparently that important property cannot stay...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Higher-Order and Symbolic Computation
سال: 2007
ISSN: 1388-3690,1573-0557
DOI: 10.1007/s10990-007-9004-2